Reduced area discrete-time down-sampling filter embedded with windowed integration samplers
نویسندگان
چکیده
منابع مشابه
Discrete-Time Randomized Sampling
Techniques for developing low-complexity, robust Digital Signal Processing (DSP) algorithms with low-power consumption have become increasingly important. This thesis explores a framework, discrete-time randomized sampling, which allows the design of algorithms that meet some desired complexity, robustness or power constraints. Three distinct sampling schemes are presented based on randomized s...
متن کاملStratified Sampling with Spherically Symmetric Importance Samplers
SUMMARY Multivariate normal or Student importance sampling is a commonly used technique for integration problems in statistical inference. This integration approach is easy to implement, has straightforward error estimates and is eeective in a number of problems. A variety of variance reduction techniques can be considered with importance sampling. Stratiied sampling is one of these and in fact...
متن کاملDiscrete-time Analytic Signals with Reduced Shiftability
In this paper we consider a common procedure [2] for generating analytic signals and show how it fails for specific discrete-time real signals. A new frequency domain technique is formulated that solves the defect. Both methods have the same redundancy. The new analytic signal preserves the original signal (real part) as also the zeros of its discrete spectrum in the negative frequencies. The s...
متن کاملFault detection reduced-order filter design for discrete-time Markov jump system with deficient transition information
The paper addresses the fault detection (FD) problem for a class of discrete-time Markov jump linear systems (MJLSs) with deficient transition rates, which simultaneously considers the totally known, partly unknown, and uncertain transition rates. Then, in accordance with the linear matrix inequality (LMI) method and the convexification techniques, a sufficient condition for the existence of FD...
متن کاملConstant-time Discrete Gaussian Sampling
Sampling from a discrete Gaussian distribution is an indispensable part of lattice-based cryptography. Several recent works have shown that the timing leakage from a non-constant-time implementation of the discrete Gaussian sampling algorithm could be exploited to recover the secret. In this paper, we propose a constant-time implementation of the Knuth-Yao random walk algorithm for performing c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronics Letters
سال: 2010
ISSN: 0013-5194
DOI: 10.1049/el.2010.1038